Enhancing active model learning with equivalence checking using simulation relations

Learning Distance Functions using Equivalence Relations

We address the problem of learning distance metrics using side-information in the form of groups of "similar" points. We propose to use the RCA algorithm, which is a simple and efficient algorithm for learning a full ranked Mahalanobis metric (Shental et al., 2002). We first show that RCA obtains the solution to an interesting optimization problem, founded on an information theoretic basis. If ...

1 Model checking and equivalence checking

Owing to the advances in semiconductor technology, a large and complex system that has a wide variety of functionalities has been integrated on a single chip. It is called system-on-a-chip (SoC) or system LSI, since all of the components in an electronics system are built on a single chip. Designs of SoCs are highly complicated and require many manpower-consuming processes. As a result, it has ...

Sequential Equivalence Checking by Symbolic Simulation

An approach for interpreted sequential veriication at diier-ent levels of abstraction by symbolic simulation is proposed. The equivalence checker has been used in previous work to compare two designs at rt-level. We describe in this paper the automatic veriication of gate-level results of a commercial synthesis tool against a behavioral speciication at rt-level. The symbolic simulator has to co...

Symbolic Model Checking with Partitioned Transistion Relations

Symbolic Model Checking with Partitioned Transition Relations

We signiicantly reduce the complexity of BDD-based symbolic veriication by using partitioned transition relations to represent state transition graphs. This method can be applied to both synchronous and asynchronous circuits. The times necessary to verify a synchronous pipeline and an asynchronous stack are both bounded by a low polynomial in the size of the circuit. We were able to handle stac...